The Hard Problems of Consciousness – What exactly is the problem ? From Logical Paradoxes to Constructivism
نویسنده
چکیده
What is it like for you to be you? This question has long fascinated philosophers and has sparked many heated discussions. At the first conference Towards a Science of Consciousness in 1994 in Tucson, Arizona, philosopher David Chalmers coined the Easy and Hard Problems of Consciousness. While the Easy Problem concerns the mechanics of nerves and the brain, the Hard Problem is concerned with issues of phenomenal or subjective experience, in particular the ability to understand and study subjective experience as if it were a third-person “objective” phenomenon. Some philosophers, like e.g. John Searle, are committed to the so-called first–person point of view that phenomenal experience is intrinsically private and inaccessible to third person studies. Others, like Daniel Dennett, believe that it is possible to objectively capture everything about a person’s subjective experience by experimental analysis of anatomical and physiological correlates of subjective experience, as well as by including introspection into the data gathering process.
منابع مشابه
New Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problems (GTSP)
Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution. The Generalized Traveling Salesman Problem (GTSP)expands the TSP to a much more complicated form, replacing single nodes with a group or cluster of nodes, where the objective is to fi...
متن کاملLogical s-t Min-Cut Problem: An Extension to the Classic s-t Min-Cut Problem
Let $G$ be a weighted digraph, $s$ and $t$ be two vertices of $G$, and $t$ is reachable from $s$. The logical $s$-$t$ min-cut (LSTMC) problem states how $t$ can be made unreachable from $s$ by removal of some edges of $G$ where (a) the sum of weights of the removed edges is minimum and (b) all outgoing edges of any vertex of $G$ cannot be removed together. If we ignore the second constraint, ca...
متن کاملSolving the vehicle routing problem by a hybrid meta-heuristic algorithm
The vehicle routing problem (VRP) is one of the most important combinational optimization problems that has nowadays received much attention because of its real application in industrial and service problems. The VRP involves routing a fleet of vehicles, each of them visiting a set of nodes such that every node is visited by exactly one vehicle only once. So, the objective is to minimize the to...
متن کاملAn Effective Genetic Algorithm for Solving the Multiple Traveling Salesman Problem
The multiple traveling salesman problem (MTSP) involves scheduling m > 1 salesmen to visit a set of n > m nodes so that each node is visited exactly once. The objective is to minimize the total distance traveled by all the salesmen. The MTSP is an example of combinatorial optimization problems, and has a multiplicity of applications, mostly in the areas of routing and scheduling. In this paper,...
متن کاملToward Islamic Republic of Iran Based on Constructivism
Turkey is one of the Muslim countries that has paid special attention (either confrontation or cooperation) to Islamic revolution in Iran. From the advent of Islamic revolution till now, Turkey has taken different stances that have determined the type of its interaction with Iran. The author intends to analyze Turkey's behavior toward Iran influenced by the revolution during different time inte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998